The independence number for polarity graphs of even order planes
نویسندگان
چکیده
In this paper, we use coherent configurations to obtain new upper bounds on the independence number of orthogonal polarity graphs of projective planes of even order. In the case of classical planes of square even order, these bounds differ only by 1 from the size of the largest known independent sets.
منابع مشابه
Wiener Polarity Index of Tensor Product of Graphs
Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...
متن کاملThe Generalized Wiener Polarity Index of some Graph Operations
Let G be a simple connected graph. The generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.
متن کاملIndependent Sets in Polarity Graphs
Given a projective plane Σ and a polarity θ of Σ, the corresponding polarity graph is the graph whose vertices are the points of Σ, and two distinct points p1 and p2 are adjacent if p1 is incident to p θ 2 in Σ. A well-known example of a polarity graph is the Erdős-Rényi orthogonal polarity graph ERq, which appears frequently in a variety of extremal problems. Eigenvalue methods provide an uppe...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملIndependence Number and Disjoint Theta Graphs
The goal of this paper is to find vertex disjoint even cycles in graphs. For this purpose, define a θ-graph to be a pair of vertices u, v with three internally disjoint paths joining u to v. Given an independence number α and a fixed integer k, the results contained in this paper provide sharp bounds on the order f(k, α) of a graph with independence number α(G) ≤ α which contains no k disjoint ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012